package com.example.leetcode.sort;

import com.example.leetcode.sort.common.SortUtils;

class Solution215 {
    public int findKthLargest(int[] nums, int k) {
        return SortUtils.findKthLargest(nums, k);
    }
}

public class leetcode215 {
    public static void main(String[] args) {
        Solution215 solution215 = new Solution215();
        int[] nums = {3, 2, 1, 5, 6, 4};
        System.out.println(solution215.findKthLargest(nums, 2));
    }
}
